Cohen–Macaulay approximation in fibred categories
نویسندگان
چکیده
منابع مشابه
Binary trees and fibred categories
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to transition systems, which arise in the theory of concurrent computing.
متن کاملFibred and Indexed Categories for Abstract Model Theory
Indexed and Fibred category theory have a long tradition in computer science as a language to formalize different presentations of the notion of a logic, as for instance, in the theory of institutions and general logics, and as unifying models of (categorical) logic and type theory as well. Here we introduce the notions of indexed and fibred frames and construct a rich mathematical workspace wh...
متن کاملApproximation in quantale-enriched categories
Our work is a foundational study of the notion of approximation inQ-categories and in (U,Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, approximating and Scott-continuous distributors, the way-below distributor, and continuity of Qand (U,Q)-categories. We fully characterize continuous Q-categories (resp. (U,Q)-categories) among all cocomplete Q-categories (...
متن کاملApproximation in Continuous Q-categories
Our work is a fundamental study of the notion of approximation inQ-categories and in (U,Q)-categories. Our exposition is categorical but kept as close to language of domain theory as possible. Consequently, we introduce auxiliary, approximating and Scott-continuous distributors, the way-below distributor, and continuity of Qand (U,Q)-categories. We fully characterize J-continuous Q-categories (...
متن کاملApproximation Problems Categories
The notion of approximation problems was formally introduced by Johnson [3] in his pioneering paper on the approximation of combinatorial optimization problems, and it was also suggested a possible classification of optimization problems on grounds of their approximability properties. Since then, it was clear that, even though the decision versions of most NP-hard optimization problems are poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2012.06.006